Interactive Connguration Using Constraint Satisfaction Techniques
نویسندگان
چکیده
In this paper, we focus on techniques for incremental constraint-based conngu-ration with discrete and continuous variables. We show how to formalize constraint knowledge using compatibility and activity constraints (Mittal 1990) and how this knowledge is used for reasoning within an intelligent CAD system. Most technical (as opposed to spatial) constraint connguration systems use algorithms for solving discrete problems (Haselboeck 1994). We claim that connguration is both discrete and continuous in nature and that new methods for handling both constraints in a uniied way must be integrated in connguration systems. Visualization of the globally consistent connguration problem space allows for a systematic and exhaustive exploration of the space in an interactive fashion (Haroud 1995). Knowledge maintenance in connguration systems must be simpliied, because connguration knowledge of todays products evolves over the whole product life cycle. The knowledge representation in deductive rule-based systems as often used in intelligent CAD systems will always be context dependent; maintenance problems resulting from this context dependency are often insurmountable. We have identi-ed the context independence of constraint-based knowledge representation as an important feature for facilitating the incremental development and maintenance of large evolving knowledge bases (Weigel 1994).
منابع مشابه
Connguration as Composite Constraint Satisfaction
Selecting and arranging parts is the core of a conngu-ration task. The validity of a connguration is deened in terms of constraints. Highly declarative, domain independent and simple to use, the constraint satisfaction problem (CSP) paradigm ooers an adequate framework for this task. However, the basic paradigm is not powerful enough to capture or to take advantage of essential aspects of conng...
متن کاملPackage Frame
In this paper, we focus on techniques for incremen-tal constraint-based connguration with discrete and continuous variables. We show how to formalize constraint knowledge using compatibility and activity constraints (Mittal 1990) and how this knowledge is used for reasoning within an intelligent CAD system. Most technical as opposed to spatial constraint connguration systems use algorithms for ...
متن کاملGenerating Tradeoos for Interactive Constraint-based Connguration
In this paper we have modeled tradeoos in constraint-based connguration as additional constraints, and begun to study the issues involved in generating and evaluating such tradeoos. We describe our basic approach in the context of a \toy" connguration problem based on the classic N-Queens problem. Initial experiments compare \proposal strategies" for generating tradeoos. We demonstrate that arc...
متن کاملProlog Technique of Implementing Searchof
Our research has been motivated by the task of forming a solution subgraph which satisses given constraints. The problem is represented by an A=O graph. Our approach is to apply a suitably modiied technique of dependency-directed backtracking. We present our formulation of the standard chronological backtracking algorithm in Prolog. Based on it, we have developed an enhanced algorithm which mak...
متن کاملConstraint-Based Modeling: From Diagnosis and Con guration to Network Management
We present a prototype system for automatic diagnosis of computer network services based on a constraint satisfaction model. In a constraint satisfaction model of a diagnosis problem, the constraints capture the structure and behavior of the system to be mod-eled, and represent relations among the attributes of the system components. The system is found faulty if some constraints can not be sat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996